Projections for Infinitary Rewriting
نویسندگان
چکیده
منابع مشابه
Projections for infinitary rewriting
Proof terms in term rewriting are a representation means for reduction sequences, and more in general for contraction activity, allowing to distinguish e.g. simultaneous from sequential reduction. Proof terms for finitary, first-order, left-linear term rewriting are described in [15], ch. 8. In a previous work [12] we defined an extension of the finitary proof-term formalism, that allows to des...
متن کاملInfinitary Term Graph Rewriting
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can be used to reason about lazy evaluation. In this paper, we combine term graph rewriting and infinitary term rewriting thereby addressing both components of ...
متن کاملInfinitary Rewriting: Foundations Revisited
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary relations in particular two concepts have been studied in the past: strongly and weakly convergent reductions, and in the last decade research has mostly focused around the former. Finitary rewriting has a strong connect...
متن کاملInfinitary Rewriting Coinductively
We provide a coinductive definition of strongly convergent reductions between infinite lambda terms. This approach avoids the notions of ordinals and metric convergence which have appeared in the earlier definitions of the concept. As an illustration, we prove the existence part of the infinitary standardization theorem. The proof is fully formalized in Coq using coinductive types. The paper co...
متن کاملProof terms for infinitary rewriting, progress report
Proof. This is an easy consequence of some properties of ordinals. Namely, β < Σ i<ω αi implies that the set {k < ω / β < α0 + . . . + αk} is nonempty; we take n as the minimum of this set. Then α0 + . . . + αn−1 ≤ β < (α0 + . . . + αn−1) + αn. Basic properties of ordinals entail the existence and uniqueness of an ordinal γ verifying (α0 + . . .+αn−1) + γ = β, and also that γ < αn. Thus we conc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2017
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2017.04.009